Numbers in a matrix - HackerEarth Solution


Red Black Tree

Python Code:

t = input()
t = t.split(' ')
count = 0
d = []
for i in range(int(t[0])):
    s = []
    for j in range(int(t[1])):
        s.append(0)
    d.append(s)
s=0
for i in range(int(t[2])):
    c = input()
    c = c.split(' ')
    if int(c[0]) == 1:
        if d[int(c[1]) - 1][int(c[2]) - 1] == 0:
            d[int(c[1]) - 1][int(c[2]) - 1] = 1
        else:
            d[int(c[1]) - 1][int(c[2]) - 1] = 0
    elif int(c[0]) == 2:
        s+=1

if s%2==0:
    for i in range(len(d)):
        for j in range(len(d[i])):
            if d[i][j] == 1:
                count += 1
            else:
                continue
else:
    for i in range(len(d)):
        for j in range(len(d[i])):
            if d[i][j] == 0:
                count += 1
            else:
                continue
print(count)


Comments

Submit
0 Comments
More Questions

1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal
1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums
20A - BerOS file system
1637A - Sorting Parts
509A - Maximum in Table
1647C - Madoka and Childish Pranks